Elementary matrix decomposition and the computation of Darmon points with higher conductor
نویسندگان
چکیده
We extend the algorithm of [DG02] and [DP06] for computing p-adic Darmon points on elliptic curves to the case of composite conductor. We also extend the algorithm of [DL03] for computing ATR Darmon points to treat curves of nontrivial conductor. Both cases involve an algorithmic decomposition into elementary matrices in congruence subgroups Γ1(N) for ideals N in certain rings of S-integers. We use these extensions to provide additional evidence in support of the conjectures on the rationality of Darmon points.
منابع مشابه
Symbolic computation of the Duggal transform
Following the results of cite{Med}, regarding the Aluthge transform of polynomial matrices, the symbolic computation of the Duggal transform of a polynomial matrix $A$ is developed in this paper, using the polar decomposition and the singular value decomposition of $A$. Thereat, the polynomial singular value decomposition method is utilized, which is an iterative algorithm with numerical charac...
متن کاملAlgorithms for Chow-Heegner points via iterated integrals
Let E/Q be an elliptic curve of conductor N and let f be the weight 2 newform on Γ0(N) associated to it by modularity. Building on an idea of S. Zhang, an article by Darmon, Rotger, and Sols describes the construction of so-called Chow-Heegner points, PT,f ∈ E(Q̄), indexed by algebraic correspondences T ⊂ X0(N) × X0(N). It also gives an analytic formula, depending only on the image of T in cohom...
متن کاملCalculation of Stray Capacitances of MCG Coil include One Turn, Single-Layer and Conductor Wire Filaments in Rectangular form
This paper presents a new method called vespiary regular hexagonal (VRH) model in order to calculate parasitic capacitance between conductor wire filaments of one turn of coil (OTC) and between conductor wire filaments and liner and also total capacitance of one turn of the helix magneto flux cumulative generator (MCG) coil include single-layer conductor wire filaments in form of rectangular cr...
متن کاملEla Accurate and Efficient Ldu Decompositions of Diagonally Dominant M-matrices
An efficient method for the computation to high relative accuracy of the LDU decomposition of an n × n row diagonally dominant M–matrix is presented, assuming that the off–diagonal entries and row sums are given. This method costs an additional O(n) elementary operations over the cost of Gaussian elimination, and leads to a lower triangular, column diagonally dominant matrix and an upper triang...
متن کاملOn p-semilinear transformations
In this paper, we introduce $p$-semilinear transformations for linear algebras over a field ${bf F}$ of positive characteristic $p$, discuss initially the elementary properties of $p$-semilinear transformations, make use of it to give some characterizations of linear algebras over a field ${bf F}$ of positive characteristic $p$. Moreover, we find a one-to-one correspondence between $p$-semiline...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Comput.
دوره 84 شماره
صفحات -
تاریخ انتشار 2015